developing a technique based on extended gravitational force to solve scheduling problem

نویسندگان

a norouzi,

a tolouei ashlaghi,

چکیده

scheduling is to determine the priorities or arrange the activities to meet the needs, limitations and certain goals. because the time is always a limited resource, all activities should be scheduled to use optimally and certainly the resource. gravitational force algorithm, like other evolutionary algorithms, is inspired by nature. the effect of the gravity on the objects reciprocally and to all objects in the space is the main idea of ​​this algorithm. in this study, after reviewing the literature, a problem of timetable scheduling for academic courses will be studied and then analyzed by using the proposed algorithm based on the principles of gravitational force algorithm. in this algorithm, the gravitational force between the answers can be calculated through 2 methods. firstly, an answer will be selected from the local neighborhood of the current answer and the gravitational force between these two answers will be calculated. secondly, the gravitational force between all neighbor answers are calculated in the neighborhood of the current answer but not limited to one neighbor answer. by comparing the methods, the result is that the first method has a relative superiority in terms of the parameters of speed and quality.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Possibility Linear Programming Approach to Solve a Fuzzy Single Machine Scheduling Problem

This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...

متن کامل

New Approaches in Metaheuristics to Solve the Truck Scheduling Problem in a Cross-docking Center

Nowadays, cross-docking is one of the main concepts in supply chain management in which products received to a distribution center by inbound trucks which are directly to lead into outbound trucks with a minimum handling and storage costs as the main cost of a cross-docking system. According to the literature, several metaheuristics and heuristics are attempted to solve this optimization model....

متن کامل

Using Grid Puzzle to Solve Constraint-based Scheduling Problem

Constraint programming (CP) is one of the most effective techniques for solving practical operational problems. The outstanding feature of the method is a set of constraints affecting a solution of a problem can be imposed without a need to explicitly defining a linear relation among variables, i.e. an equation. Nevertheless, the challenge of paramount importance in using this technique is how ...

متن کامل

Gravitational Search Algorithm to Solve the K-of-N Lifetime Problem in Two-Tiered WSNs

Wireless Sensor Networks (WSNs) are networks of autonomous nodes used for monitoring an environment. In designing WSNs, one of the main issues is limited energy source for each sensor node. Hence, offering ways to optimize energy consumption in WSNs which eventually increases the network lifetime is strongly felt. Gravitational Search Algorithm (GSA) is a novel stochastic population-based meta-...

متن کامل

Extended Decomposition for Mixed Integer Programming to Solve a Workforce Scheduling and Routing Problem

We propose an approach based on mixed integer programming (MIP) with decomposition to solve a workforce scheduling and routing problem, in which a set of workers should be assigned to tasks that are distributed across different geographical locations. We present a mixed integer programming model that incorporates important realworld features of the problem such as defined geographical regions a...

متن کامل

A novel hybrid genetic algorithm to solve the make-to-order sequence-dependent flow-shop scheduling problem

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
journal of industrial strategic management

ناشر: islamic azad university of firoozkooh branch

ISSN

دوره 11

شماره 35 2014

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023